Playing with Subshifts
نویسندگان
چکیده
We study the class of word-building games, where two players pick letters from a finite alphabet to construct a finite or infinite word. The outcome is determined by whether the resulting word lies in a prescribed set (a win for player A) or not (a win for player B). We focus on symbolic dynamical games, where the target set is a subshift. We investigate the relation between the target subshift and the set of turn orders for which A has a winning strategy.
منابع مشابه
On winning shifts of marked uniform substitutions
The second author introduced with I. Törmä a two-player word-building game [Playing with Subshifts, Fund. Inform. 132 (2014), 131–152]. The game has a predetermined (possibly finite) choice sequence α1, α2, . . . of integers such that on round n the player A chooses a subset Sn of size αn of some fixed finite alphabet and the player B picks a letter from the set Sn. The outcome is determined by...
متن کاملTuring Degree Spectra of Minimal Subshifts
Subshifts are shift invariant closed subsets of Σ d , minimal subshifts are subshifts in which all points contain the same patterns. It has been proved by Jeandel and Vanier that the Turing degree spectra of nonperiodic minimal subshifts always contain the cone of Turing degrees above any of its degree. It was however not known whether each minimal subshift’s spectrum was formed of exactly one ...
متن کاملThe Complexity of the Topological Conjugacy Problem for Toeplitz Subshifts
In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show that the topological conjugacy relation is hyperfinite on a larger class of Toeplitz subshifts which we call Toeplitz subshifts with growing blocks. This resul...
متن کامل0 M ar 2 01 2 On Shift Spaces with Algebraic Structure ⋆
We investigate subshifts with a general algebraic structure and cellular automata on them, with an emphasis on (order-theoretic) lattices. Our main results concern the characterization of Boolean algebraic subshifts, conditions for algebraic subshifts to be recoded into cellwise algebras and the limit dynamics of homomorphic cellular automata on lattice subshifts.
متن کاملThe Chain Relation in Sofic Subshifts
Alexandr Kazda The chain relation in sofic subshifts Introduction Characterisation of the chain relation Summary Outline 1 Introduction Shifts and subshifts The chain relation 2 Characterisation of the chain relation Linking graph Theorem about chain relation Corollaries Alexandr Kazda The chain relation in sofic subshifts Introduction Characterisation of the chain relation Summary Shifts and s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 132 شماره
صفحات -
تاریخ انتشار 2014